Primary Partition "Virtually-Synchronous Communication" harder than Consensus
نویسندگان
چکیده
The paper considers the problem of implementing \Virtu-ally Synchronous Communication" in the primary partition of an asyn-chronous system. Virtually Synchronous Communication was rst introduced by the Isis system as a powerful mechanism for building fault-tolerant processes that mask failures by replication: it can be understood as a rule for ordering message deliveries (reliable multicasts) with respect to view changes, deened by a membership service. Primary partition Virtually Synchronous Communication, noted PP-VSC, is the problem of implementing Virtually Synchronous Communication in the case of totally ordered views. The paper formally deenes the problem, and shows that surprisingly this problem is harder than consensus: (1) consensus is solvable whenever the PP-VSC problem is solvable, however (2) there are environments where consensus is solvable, but not PP-VSC. The paper also deenes an environment in which PP-VSC can be solved. The practical consequences of the result are discussed.
منابع مشابه
Uniform Consensus is Harder than Consensus ( extended abstract )
We compare the consensus problem with the uniform consensus problem in synchronous systems. In contrast to consensus, uniform consensus is not solvable in synchronous systems with byzantine failures. This still holds for the omission failure model if a majority of processes may be faulty. For the crash failure model, both consensus and uniform consensus are solvable, no matter how many processe...
متن کاملUniform consensus is harder than consensus
We compare the consensus and uniform consensus problems in synchronous systems. In contrast to consensus, uniform consensus is not solvable with byzantine failures. This still holds for the omission failure model if a majority of processes may be faulty. For the crash failure model, both consensus and uniform consensus are solvable, no matter how many processes are faulty. In this failure model...
متن کاملCoordination Problems in Distributed Systems (extended Abstract)
In this paper we provide a framework for understanding and comparing various lower bounds and impossibility results concerning the solution to coordination problems like atomic commit for distributed transactions and other consensus problems . The key to our treatment is the distinction between information that is transferred by (datagram) messages and information that can be deduced from the e...
متن کاملStructured Derivation of Semi-Synchronous Algorithms
The semi-synchronous model is an important middle ground between the synchronous and the asynchronous models of distributed computing. In this model, processes can detect (timeout) when other processes fail. However, since detection is done by timing out, it incurs a cost much higher than the typical delay of messages. The paper presents a new communication primitive,Timely Announced Broadcast ...
متن کاملA Virtually Synchronous Group Multicast Algorithm for WANs: Formal Approach
This paper presents a formal design for a novel group communication service targeted for wide-area networks (WANs). The service provides virtual synchrony semantics. Such semantics facilitate the design of fault tolerant distributed applications. The presented design is more suitable for WANs than previously suggested ones. In particular, it features the first algorithm to achieve virtual synch...
متن کامل